Minimizing Cost and Delay in Shared Multicast Trees
نویسندگان
چکیده
منابع مشابه
Delay-Constrained Shared Multicast Trees
We study the problem of constructing delay-constrained shared multicast trees for realtime applications in connection-oriented high-speed networks. We formulate the problem as a diameter-constrained minimum Steiner tree problem, and prove that it is NP-complete. Then we propose distributed, dynamic heuristics for solving this problem. Most previous work on shared multicast trees starts by selec...
متن کاملOverlay Multicast Tree Minimizing Average Time Delay
In this work, we present an overlay multicast tree constructing algorithm to minimize the average time delay from the sender to end-systems. At the same time, the proposed algorithm considers the computing power and the network condition of each end-system as a control variable and thus we can avoid the disastrous case that loads are concentrated to only several endsystems. The multicast tree i...
متن کاملMultisites Coordination in Shared Multicast Trees
The majority of today's Internet applications relies on point-to-point transmission. In recent years, however, multicast transmission has become the foundation for such applications as multiparty video conferencing, distributed interactive simulations, and collaborative systems. We describe a novel protocol to coordinate multipoint groupwork in the IP-multicast framework. The protocol supports ...
متن کاملCost, Delay, and Delay Variation Conscious Multicast Routing
We consider a constrained Steiner tree problem in which it is necessary to provide bounded delays between the source and all destinations, as well as bounded variation among these delays. The delay and delay variation bounds are directly related to the quality of service requirements of real-time interactive applications that will use the tree for multicast communication. The main contribution ...
متن کاملOn Minimizing Multicast Completion Delay for Instantly Decodable Network Coding
In this paper, we consider the problem of minimizing the mean completion delay in wireless multicast for instantly decodable network coding. We first formulate the problem as a stochastic shortest path (SSP) problem. Although finding the optimal selection policy using SSP is intractable, we use this formulation to draw the theoretical properties of efficient selection algorithms. Based on these...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ETRI Journal
سال: 2000
ISSN: 1225-6463
DOI: 10.4218/etrij.00.0100.0104